An Improved Image Compressor Using Fast DCT Algorithm
نویسنده
چکیده
Video processing systems such as HEVC requiring low energy consumption needed for the multimedia market has lead to extensive development in fast algorithms for the efficient approximation of 2-D DCT transforms. The DCT is employed in a multitude of compression standards due to its remarkable energy compaction properties. Multiplier-free approximate DCT transforms have been proposed that offer superior compression performance at very low circuit complexity. Such approximations can be realized in digital VLSI hardware using additions and subtractions only, leading to significant reductions in chip area and power consumption compared to conventional DCTs and integer transforms. In this paper, we introduce a novel 8-point DCT approximation that requires only 14 addition operations and no multiplications. The proposed transform possesses low computational complexity and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio. The proposed DCT approximation is a candidate for reconfigurable video standards such as HEVC. The proposed transform and several other DCT approximations are mapped to systolic-array digital architectures and physically realized as digital prototype circuits using FPGA technology and mapped to 45 nm CMOS technology.
منابع مشابه
Accurate Fruits Fault Detection in Agricultural Goods using an Efficient Algorithm
The main purpose of this paper was to introduce an efficient algorithm for fault identification in fruits images. First, input image was de-noised using the combination of Block Matching and 3D filtering (BM3D) and Principle Component Analysis (PCA) model. Afterward, in order to reduce the size of images and increase the execution speed, refined Discrete Cosine Transform (DCT) algorithm was uti...
متن کاملImproving the quality of images synthesized by discrete cosines transform – regression based method using principle component analysis
Purpose: Different views of an individuals’ image may be required for proper face recognition. Recently, discrete cosines transform (DCT) based method has been used to synthesize virtual views of an image using only one frontal image. In this work the performance of two different algorithms was examined to produce virtual views of one frontal image. Materials and Methods: Two new meth...
متن کاملHigh Precision DCT CORDIC Architectures for Maximum PSNR
This paper proposes two optimal Cordic Loeffler based DCT (Discrete Cosine Transform algorithm) architectures: a fast and low Power DCT architecture and a high PSNR DCT architecture. The rotation parameters of CORDIC angles required for these architectures have been calculated using a MATLAB script. This script allows the variation of the angle’s precision from 10−1 to 10−4. The experimental re...
متن کاملThe Fast DCT and IDCT Algorithm by Subband Decomposition of Signal
Abstract DCT (Discrete Cosine Transforms) and IDCT (Inverse Discrete Cosine Transforms) are widely used for digital signal and image processing. Computational efficiency of DCT and IDCT dominate the performance of processing. How to improve computational efficiency is still an interesting topic for many researchers. In this study, the multiple-level resolution DCT in which the subband decomposi...
متن کاملA fast degradation-free algorithm for DCT block extraction in the compressed domain
A fast, degradation-free solution for the DCT block extraction problem is proposed. The problem is defined as extracting a DCT block from a DCT compressed frame composed of DCT blocks. This problem is encountered in both video/image manipulations in the compressed domain and transcodecs, for example, converting from MPEG to Motion JPEG. Traditionally, solutions involve using the pixel domain ma...
متن کامل